Quantitative Uniform Approximation by Generalized Discrete Singular Operators
نویسندگان
چکیده
Here we study the approximation properties with rates of generalized discrete versions of Picard, Gauss-Weierstrass, and Poisson-Cauchy singular operators. We treat both the unitary and non-unitary cases of the operators above. We establish quantitatively the pointwise and uniform convergences of these operators to the unit operator by involving the uniform higher modulus of smoothness of a uniformly continuous function. AMS 2010 Mathematics Subject Classi cation: 26A15, 26D15, 41A17, 41A25. Key Words and Phrases: Discrete singular operator, modulus of smoothness, uniform convergence. 1 Introduction This article is motivated mainly by "Sur les multiplicateurs dinterpolation, J. Math. Pures Appl., IX, 23(1944), 219-247", where J. Favard in 1944 introduced the discrete version of Gauss-Weierstrass operator (Fnf) (x) = 1 p n 1 X = 1 f n exp n n x 2 ; (1) n 2 N; which has the property that (Fnf) (x) converges to f(x) pointwise for each x 2 R; and uniformly on any compact subinterval of R; for each continuous function f (f 2 C(R)) that ful lls jf(t)j AeBt2 ; t 2 R; where A; B are positive constants.
منابع مشابه
Generalized Hyperinterpolation on the Sphere and the Newman–Shapiro Operators
Hyperinterpolation on the sphere, as introduced by Sloan in 1995, is a constructive approximation method which is favorable in comparison with interpolation, but still lacking in pointwise convergence in the uniform norm. For this reason we combine the idea of hyperinterpolation and of summation in a concept of generalized hyperinterpolation. This is no longer projectory, but convergent if a ma...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملRough approximation operators based on quantale-valued fuzzy generalized neighborhood systems
Let $L$ be an integral and commutative quantale. In this paper, by fuzzifying the notion of generalized neighborhood systems, the notion of $L$-fuzzy generalized neighborhoodsystem is introduced and then a pair of lower and upperapproximation operators based on it are defined and discussed. It is proved that these approximation operators include generalized neighborhood system...
متن کاملGlobal smoothness preservation and simultaneous approximation by multivariate discrete operators
In this article we study the multivariate generalized discrete singular operators defined on R , N ≥ 1, regarding their simultaneus global smoothness preservation property with respect to Lp norm for 1 ≤ p ≤ ∞, by using higher order moduli of smoothness. Furthermore, we study their simultaneous approximation properties. Mathematics Subject Classification (2010): 26A15, 26D15, 41A17, 41A25, 41A2...
متن کاملA novel technique for a class of singular boundary value problems
In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...
متن کامل